A Polynomial Time Graph Isomorphism Algorithm For Graphs That Are Not Locally Triangle-Free
نویسنده
چکیده
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for a restricted class of graphs which are not triangle-free graphs. We consider graphs that have atleast 2 vertices in all rearranged sub-graphs. An Individualization-Refinement procedure(1 Dimensional Weisfeiler-Lehman Method) is used to rearrange one graph which splits the graph into disjoint vertex sets. Then, in another graph, we construct a search tree for corresponding subgraph. Search trees provide necessary permutations for constructing an isomorphism( if graphs are isomorphic).
منابع مشابه
O(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees
In this paper G is called the “test graph” and P is called the “pattern graph.” The problem has wide applications. For example, a graph G is planar if it does not have a subgraph which is homeomorphic to K,., or K,. The SHP is NP-complete by reduction from the Hamiltonian path problem [2]. If the pattern graph P is fixed, several complicated polynomial algorithms have been found for a particula...
متن کاملAlgorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
The 3-coloring problem is well known to be NP-complete. It is also well known that it remains NP-complete when the input is restricted to graphs with diameter 4. Moreover, assuming the Exponential Time Hypothesis (ETH), 3-coloring can not be solved in time 2 on graphs with n vertices and diameter at most 4. In spite of the extensive studies of the 3-coloring problem with respect to several basi...
متن کاملAlgorithms for Graphs of (Locally) Bounded Treewidth
Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...
متن کاملPolynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded treewidth graphs, very little is known about isomorphism of bounded cliquewidth graphs. We give the first polynomial-time graph isomorphism ...
متن کاملGraph Isomorphism
While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016